BDD Package Based on Boolean NOR Operation

نویسندگان

  • M. Raseen
  • P. W. C. Prasad
  • A. Harb
چکیده

Binary Decision Diagrams (BDDs) are useful data structures for symbolic Boolean manipulations. BDDs are used in many tasks in VLSI/CAD, such as equivalence checking, property checking, logic synthesis, and false paths. In this paper we describe a new approach for the realization of a BDD package. To perform manipulations of Boolean functions, the proposed approach does not depend on the recursive synthesis operation of the IF-Then-Else (ITE). Instead of using the ITE operation, the basic synthesis algorithm is done using Boolean NOR operation. Keywords— Binary Decision Diagram (BDD), ITE Operation, Boolean Function, NOR operation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Alternative Implementation of BDD - Packages byMulti -

In this paper we present a new approach for the realization of a BDD-package. This approach does not depend on recursive synthesis operations (i.e. the ternary If-Then-Else-operator (ITE)) to perform manipulations of Boolean functions; instead our basic operation MORE is based on exchanges of neighbouring variables and existential quantiication. It is capable of combining an arbitrary number of...

متن کامل

An Alternative Implementation of BDD - Packages byMulti - Operand Synthesis

In this paper we present a new approach for the realization of a BDD-package. This approach does not depend on recursive synthesis operations (i.e. the ternary If-Then-Else-operator (ITE)) to perform manipulations of Boolean functions; instead our basic operation MORE is based on exchanges of neighbouring variables and existential quantiication. It is capable of combining an arbitrary number of...

متن کامل

Counter Examples to the Conjecture on the Complexity of BDD Binary Operations

(Abstract) In this article, we disprove the long-standing conjecture, proposed by R. E. Bryant in 1986, that any binary operation on two Boolean functions can be performed by his BDD algorithm in input-output linear time. We present Boolean functions for which his algorithm requires quadratic time in the input-output size for any non-trivial binary operation such as ∧, ∨, and ⊕. For the operati...

متن کامل

A BDD-Based Algorithm for Analysis of Multistate Systems with Multistate Components

In this paper, a new algorithm based on Binary Decision Diagram (BDD) for the analysis of a system with multistate components is proposed. Each state of a multistate component is represented by a Boolean variable, and a multistate system is represented by a series of multistate fault trees. A Boolean algebra with restrictions on variables is used to address the dependence among these Boolean va...

متن کامل

Preprocessing Boolean Formulae for BDDs in a Probabilistic Context

Inference in many probabilistic logic systems is based on representing the proofs of a query as a DNF Boolean formula. Assessing the probability of such a formula is known as a #P-hard task. In practice, a large DNF is given to a BDD software package to construct the corresponding BDD. The DNF has to be transformed into the input format of the package. This is the preprocessing step. In this pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006